Finding a manhattan path and related problems
نویسندگان
چکیده
منابع مشابه
Regular Algebra Applied to Path - finding Problems
In an earlier paper, one of the authors presented an algebra for formulating and solving extremal path problems. There are striking similarities between that algebra and the algebra of regular languages, which lead one to consider whether the previous results can be generalized—for instance to path enumeration problems—and whether the algebra of regular languages can itself be profitably used f...
متن کاملFinding objects through stochastic shortest path problems
This paper presents a novel formulation for the problem of finding objects in a known environment while minimizing the search cost. Our approach consists in formalizing this class of problems as Stochastic Shortest Path (SSP) problems, a decision-theoretic framework for probabilistic environments. The obtained problems are solved by using offthe-shelf domain-independent probabilistic planners. ...
متن کاملA Continuation Method for Nonholonomic Path-finding Problems
In this note we study the mathematical theory of one particular algorithm for nonholonomic point-to-point path nding. The algorithm considered here is a \continuation" or \deformation" method, in which one starts with an admissible trajectory that goes from the desired initial point p to some point q0, and then tries to construct a one-parameter family of trajectories, whose terminal points qs ...
متن کاملAas an Optimal Resource Allocation Policy in Path Finding Problems
Consider a problem of finding a path from a start to a goal node on a graph. Suppose that we have divided the problem into smaller problems by dividing the search graph into subgraphs. Nodes and edges in a subgraph form subsets of the nodes and the edges in the original search graph. Assume that we have either specialized algorithms for searching the subgraphs or only a single algorithm expandi...
متن کاملRandomized Shortest-Path Problems: Two Related Models
This letter addresses the problem of designing the transition probabilities of a finite Markov chain (the policy) in order to minimize the expected cost for reaching a destination node from a source node while maintaining a fixed level of entropy spread throughout the network (the exploration). It is motivated by the following scenario. Suppose you have to route agents through a network in some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1983
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.3230130308